Numerical solution of multivariate polynomial systems by homotopy continuation methods
نویسنده
چکیده
pn(xi,...,xn) = 0 for x = (x\,... ,xn). This problem is very common in many fields of science and engineering, such as formula construction, geometric intersection problems, inverse kinematics, power flow problems with PQ-specified bases, computation of equilibrium states, etc. Elimination theory-based methods, most notably the Buchberger algorithm (Buchberger 1985) for constructing Grobner bases, are the classical approach to solving (1.1), but their reliance on symbolic manipulation makes those methods seem somewhat unsuitable for all but small problems.
منابع مشابه
Using Monodromy to Decompose Solution Sets of Polynomial Systems into Irreducible Components
To decompose solution sets of polynomial systems into irreducible components, homotopy continuation methods generate the action of a natural monodromy group which partially classi es generic points onto their respective irreducible components. As illustrated by the performance on several test examples, this new method achieves a great increase in speed and accuracy, as well as improved numerica...
متن کاملNumerical Stablity of Path Tracing in Polyhedral Homotopy Continuation Methods
The reliability of polyhedral homotopy continuation methods for solving a polynomial system becomes increasingly important as the dimension of the polynomial system increases. High powers of the homotopy continuation parameter t and ill-conditioned Jacobian matrices encountered in tracing of homotopy paths affect the numerical stability. We present modified homotopy functions with a new homotop...
متن کاملPolynomial Homotopies for Dense, Sparse and Determinantal Systems
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution of a generic system that is used to start up the deformations. Software and applications are discussed. AMS Subject Classification. 14N10, 14M15, 52A39, 52B...
متن کاملBalancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
Polyhedral homotopy continuation methods exploit the sparsity of polynomial systems so that the number of solution curves to reach all isolated solutions is optimal for generic systems. The numerical stability of tracing solution curves of polyhedral homotopies is mainly determined by the height of the powers of the continuation parameter. To reduce this height we propose a procedure that opera...
متن کاملPHoM: Polyhedral Homotopy Continuation Method for Polynomial Systems
PHoM is a software package in C++ for finding all isolated solutions of polynomial systems using a polyhedral homotopy continuation method. Among three modules constituting the package, the first module StartSystem constructs a family of polyhedrallinear homotopy functions, based on the polyhedral homotopy theory, from input data for a given system of polynomial equations f(x) = 0. The second m...
متن کامل